A complexity dichotomy for poset constraint satisfaction

In this paper we determine the complexity of a broad class of problems that extends the temporal constraint satisfaction problems. To be more precise we study the problems Poset-SAT($\Phi$), where $\Phi$ is a given set of quantifier-free $\leq$-formulas. An instance of Poset-SAT($\Phi$) consists of finitely many variables $x_1,\ldots,x_n$ and formulas $\phi_i(x_{i_1},\ldots,x_{i_k})$ with $\phi_i \in \Phi$; the question is whether this input is satisfied by any partial order on $x_1,\ldots,x_n$ or not. We show that every such problem is NP-complete or can be solved in polynomial time, depending on $\Phi$. All Poset-SAT problems can be formalized as constraint satisfaction problems on reducts of the random partial order. We use model-theoretic concepts and techniques from universal algebra to study these reducts. In the course of this analysis we establish a dichotomy that we believe is of independent interest in universal algebra and model theory.Comment: 29 page

The subpower membership problem of 2-nilpotent algebras

The subpower membership problem SMP(A) of a finite algebraic structure A asks whether a given partial function from A^k to A can be interpolated by a term operation of A, or not. While this problem can be EXPTIME-complete in general, Willard asked whether it is always solvable in polynomial time if A is a Mal'tsev algebras. In particular, this includes many important structures studied in abstract algebra, such as groups, quasigroups, rings, Boolean algebras. In this paper we give an affirmative answer to Willard's question for a big class of 2-nilpotent Mal'tsev algebras. We furthermore develop tools that might be essential in answering the question for general nilpotent Mal'tsev algebras in the future.Comment: 17 pages (including appendix

Short Definitions in Constraint Languages

A first-order formula is called primitive positive (pp) if it only admits the use of existential quantifiers and conjunction. Pp-formulas are a central concept in (fixed-template) constraint satisfaction since CSP(?) can be viewed as the problem of deciding the primitive positive theory of ?, and pp-definability captures gadget reductions between CSPs. An important class of tractable constraint languages ? is characterized by having few subpowers, that is, the number of n-ary relations pp-definable from ? is bounded by 2^p(n) for some polynomial p(n). In this paper we study a restriction of this property, stating that every pp-definable relation is definable by a pp-formula of polynomial length. We conjecture that the existence of such short definitions is actually equivalent to ? having few subpowers, and verify this conjecture for a large subclass that, in particular, includes all constraint languages on three-element domains. We furthermore discuss how our conjecture imposes an upper complexity bound of co-NP on the subpower membership problem of algebras with few subpowers

A counterexample to the reconstruction of ω\omega-categorical structures from their endomorphism monoids

We present an example of two countable $\omega$-categorical structures, one of which has a finite relational language, whose endomorphism monoids are isomorphic as abstract monoids, but not as topological monoids -- in other words, no isomorphism between these monoids is a homeomorphism. For the same two structures, the automorphism groups and polymorphism clones are isomorphic, but not topologically isomorphic. In particular, there exists a countable $\omega$-categorical structure in a finite relational language which can neither be reconstructed up to first-order bi-interpretations from its automorphism group, nor up to existential positive bi-interpretations from its endomorphism monoid, nor up to primitive positive bi-interpretations from its polymorphism clone.Comment: 17 page

CC-circuits and the expressive power of nilpotent algebras

We show that CC-circuits of bounded depth have the same expressive power as polynomials over finite nilpotent algebras from congruence modular varieties. We use this result to phrase and discuss an algebraic version of Barrington, Straubing and Th\'erien's conjecture, which states that CC-circuits of bounded depth need exponential size to compute AND. Furthermore we investigate the complexity of deciding identities and solving equations in a fixed nilpotent algebra. Under the assumption that the conjecture is true, we obtain quasipolynomial algorithms for both problems. On the other hand, if AND is computable by uniform CC-circuits of bounded depth and polynomial size, we can construct a nilpotent algebra with coNP-complete, respectively NP-complete problem.Comment: 14 page

Short definitions in constraint languages

A first-order formula is called primitive positive (pp) if it only admits the use of existential quantifiers and conjunction. Pp-formulas are a central concept in (fixed-template) constraint satisfaction since CSP($\Gamma$) can be viewed as the problem of deciding the primitive positive theory of $\Gamma$, and pp-definability captures gadget reductions between CSPs. An important class of tractable constraint languages $\Gamma$ is characterized by having few subpowers, that is, the number of $n$-ary relations pp-definable from $\Gamma$ is bounded by $2^{p(n)}$ for some polynomial $p(n)$. In this paper we study a restriction of this property, stating that every pp-definable relation is definable by a pp-formula of polynomial length. We conjecture that the existence of such short definitions is actually equivalent to $\Gamma$ having few subpowers, and verify this conjecture for a large subclass that, in particular, includes all constraint languages on three-element domains. We furthermore discuss how our conjecture imposes an upper complexity bound of co-NP on the subpower membership problem of algebras with few subpowers

In situ testing of early age energy absorption in sprayed fiber reinforced concrete - HyEA – test

The properties of fibre-reinforced sprayed concrete concerning energy absorption are mainly assessed according the standard of EFNARC, EN14488-5 and ASTM C 1550. Energy absorption will be measured after 28 days up to a deflection of 25 or 40 mm (depending on the applied standard). Fibre-reinforced concrete is often used for rock support and as a first safety layer. When covering the tunnel face with fibre-reinforced sprayed concrete, the concrete will be removed after approx. 6 to 12 hours. Taking into account the situation in modern tunnel headings, the performance of fibre-reinforced sprayed concrete with-in the first hours is essential to provide a sufficient safety level, while accelerating work progress. For those applications the 28-day-properties have no relevance. Even for durable sprayed concrete applications the early support function of rein-forced sprayed concrete will be decisively for the loading bearing behaviour of the rock support system. Currently, there is no test procedure available to assess the properties – specially load bearing - of fibre-reinforced concrete within the first hours. At early age only the early strength is determined, e. g. penetration needle acc. EN 14488-2 (“HILTI”-method). Hagerbach Test Gallery (VSH, Switzerland) has been operating an underground facility for research and development activities for more than 40 years. Based on the above mentioned considerations a test method has been developed to assess the capability of energy absorption of young sprayed concrete. The test method is named HyEA-TestTM. (HyEA-Test = Hagerbach young Early Age-Test) Based on the experience with production, application and testing of shotcrete, VSH did evaluate during research projects with different mix-designs and fibre contents the test method. As a result of the research projects a mobile testing equipment for in-situ use at construction sites faces was developed and designed. The results from these research projects will show, that it is possible to test the ener-gy absorption according to ASTM C1550 in a very early age, meaning during the first hours after the application. Furthermore it is possible to achieve results in such a quality to get information about best dosage of fibres, performance of fibres and mix optimization in general. The presentation is showing, that the test method should be used for quality control during tunnel excavation. The test method is very helpful to increase the safety level during excavation and installing of additional rock support

Forbidden cycles in metrically homogeneous graphs

Aranda, Bradley-Williams, Hubi\v{c}ka, Karamanlis, Kompatscher, Kone\v{c}n\'y and Pawliuk recently proved that for every primitive 3-constrained space $\Gamma$ of finite diameter $\delta$ from Cherlin's catalogue of metrically homogeneous graphs there is a finite family $\mathcal F$ of $\{1,2,\ldots, \delta\}$-edge-labelled cycles such that each $\{1,2,\ldots, \delta\}$-edge-labelled graph is a (not necessarily induced) subgraph of $\Gamma$ if and only if it contains no homomorphic images of cycles from $\mathcal F$. This analysis is a key to showing that the ages of metrically homogeneous graphs have Ramsey expansions and the extension property for partial automorphisms. In this paper we give an explicit description of the cycles in families $\mathcal F$. This has further applications, for example, interpreting the graphs as semigroup-valued metric spaces or homogenizations of $\omega$-categorical $\{1,\delta\}$-edge-labelled graphs.Comment: 24 pages, 2 table